On triangles and tetragones

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Tensor Product of Graphs, Girth and Triangles

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.

متن کامل

ON LUCAS v-TRIANGLES

are well known. A list of such basic identities can be found in [3]. If A ^ ±1 or B ^ 1, then w1? s^,... are nonzero by [1], and so are vx = u2lul9 v2 = M4/M2, ... . In the case A = B 1, we noted in [1] that un = 0 o 31n. IF vw = 0, then uln = i/wvw = 0; hence, 31n and un = Q, which is impossible since v~Au = 4B (cf. [3]). Thus, v0,v1? v2,... are all nonzero. We set vw! = Ilo ^ reg...

متن کامل

On convex Bézier triangles

— Goodman [8] showed that uniform subdivision of triangular Bézier nets preserves convexity. Hère, a very short proofofthis f act is given which applies even to box spline surfaces and degree élévation instead of subdivision. Secondiy, it is shown that every Bézier net of a quadratic convex Bézier triangle can be subdivided such that the net becomes convex.

متن کامل

On Heron triangles

There has previously been given a one-parameter family of pairs of Heron triangles with equal perimeter and area. In this note, we find two twoparameter families of such triangle pairs, one of which contains the known one-parameter family as a special case. Second, for an arbitrary integer n > 2 we show how to find a set of n Heron triangles in two parameters such that all triangles have equal ...

متن کامل

On Broken Triangles

A binary CSP instance satisfying the broken-triangle property (BTP) can be solved in polynomial time. Unfortunately, in practice, few instances satisfy the BTP. We show that a local version of the BTP allows the merging of domain values in arbitrary instances of binary CSP, thus providing a novel polynomial-time reduction operation. Extensive experimental trials on benchmark instances demonstra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Časopis pro pěstování matematiky a fysiky

سال: 1877

ISSN: 1802-114X

DOI: 10.21136/cpmf.1877.121690